// https://leetcode.cn/problems/na-ying-bi/
// Created by ade on 2022/9/16.
//
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution {
public:
    int minCount(vector<int> &coins) {
        int sum = 0;
        for (auto &i : coins) {
            if (i <= 2) sum++;
            else {
                sum += i / 2;
                if (i % 2 == 1)sum++;
            }
        }
        return sum;
    }
};

int main() {
    Solution so;

}